unordered pair造句

• However, the unordered pair formed by both points is invariant under similarities.
• The induced action on unordered pairs of points gives a rank 3 action on 55 points.
• The six vertices of the Sch鰊hardt polyhedron can be used to form fifteen unordered pairs of vertices.
• In another generalized notion, " E " is a multiset of unordered pairs of ( not necessarily distinct ) vertices.
• The existence axioms, e . g . the existence of the unordered pair, is also implemented indirectly by the definition of term constructors.
• A 1999 report, generalizes the Universal Distribution and associated convergence theorems to unordered sets of strings and a 2008 report, to unordered pairs of strings.
• My question : Is there an efficient way to match the unordered pairs with the vertices in the picture on that page ? talk ) 19 : 24, 7 April 2011 ( UTC)
• These are the vertex permutations ( " S " 4 in its natural action ) and the edge permutations ( " S " 4 acting on unordered pairs ) that they induce:
• It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, which are usually called " edges ", " arcs ", or " lines ".
• One is the action on unordered pairs with orbit sizes 1 + 42 + 210 and point stabilizer M 21.2, and the other is the action on heptads with orbit sizes 1 + 112 + 140 and point stabilizer 2 4 . A 7.
• According to this, I would expect that " random graph ", say with ( possibly infinite ) vertex set V, in the most general meaning should refer to any measurable map \ scriptstyle X : \ Omega \ to 2 ^ K, where K is the set of all unordered pairs of V, and of course, the power set 2 ^ K is equipped with the product sigma algebra.
• A cardinal number \ kappa is called "'ineffable "'if for every binary-valued function f : \ mathcal { P } _ { = 2 } ( \ kappa ) \ to \ { 0, 1 \ }, there is a stationary subset of \ kappa on which f is homogeneous : that is, either f maps all unordered pairs of elements drawn from that subset to zero, or it maps all such unordered pairs to one.
• A cardinal number \ kappa is called "'ineffable "'if for every binary-valued function f : \ mathcal { P } _ { = 2 } ( \ kappa ) \ to \ { 0, 1 \ }, there is a stationary subset of \ kappa on which f is homogeneous : that is, either f maps all unordered pairs of elements drawn from that subset to zero, or it maps all such unordered pairs to one.